Turán’s graph theorem, measures and probability theory

نویسنده

  • Gyula O.H. Katona
چکیده

Let us start with the well-known graph theorem of Turán that determines the largest number of edges in a graph on n vertices containing no complete graph on k + 1 vertices. If 1 ≤ k ≤ n are integers, define the graph T (n, k) whose vertex set is V1 ∪ V2 ∪ . . . ∪ Vk where the Vis are pairwise disjoint and their sizes are either ⌊ n k ⌋ or ⌈ n k ⌉ and two vertices are adjacent if and only if they are in two different Vis. It is easy to see that T (n, k) contains no complete graph on k + 1 vertices. The number of edges of T (n, k) is denoted by t(n, k).

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Turán’s Graph Theorem and Maximum Independent Sets in Brandt Semigroups

Let Bn be an aperiodic Brandt semigroup M0[G;n, n;P ] where G is the trivial group, n ∈ N and P = (aij)n×n with aij = 1G if i = j and aij = 0 otherwise. The maximum size of an independent set in Bn is known to be bn2/4c+n, where bn2/4c denotes the largest integer not greater than n2/4. We reprove this result using Turán’s famous graph theorem. Moreover, we give a characterization of all indepen...

متن کامل

Paul Turán’s influence in combinatorics

This paper is a survey on the topic in extremal graph theory influenced directly or indirectly by Paul Turán. While trying to cover a fairly wide area, I will try to avoid most of the technical details. Areas covered by detailed fairly recent surveys will also be treated only briefly. The last part of the survey deals with random ±1 matrices, connected to some early results of Szekeres and Turán.

متن کامل

Turán’s theorem with colors

We consider a generalization of Turán’s theorem for edge-colored graphs. Suppose that R (red) and B (blue) are graphs on the same vertex set of size n. We conjecture that if R and B each have more than (1− 1/k)n/2 edges, and K is a (k+ 1)-clique whose edges are arbitrarily colored with red and blue, then R ∪B contains a colored copy of K, for all k + 1 6∈ {4, 6, 8}. If k + 1 ∈ {4, 6, 8}, then t...

متن کامل

Fractional Probability Measure and Its Properties

Based on recent studies by Guy Jumarie [1] which defines probability density of fractional order and fractional moments by using fractional calculus (fractional derivatives and fractional integration), this study expands the concept of probability density of fractional order by defining the fractional probability measure, which leads to a fractional probability theory parallel to the classical ...

متن کامل

Quantum Mechanics as a Theory of Probability

We develop and defend the thesis that the Hilbert space formalism of quantum mechanics is a new theory of probability. The theory, like its classical counterpart, consists of an algebra of events, and the probability measures defined on it. The construction proceeds in the following steps: (a) Axioms for the algebra of events are introduced following Birkhoff and von Neumann. All axioms, except...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013